JMLR: Workshop and Conference Proceedings vol 40:1–33, 2015 Stochastic Block Model and Community Detection in Sparse Graphs: A spectral algorithm with optimal rate of recovery ∗ Peter Chin

Source URL: jmlr.org

• Mathematics
• Graph theory
• Discrete mathematics
• NP-complete problems
• Combinatorics
• Partition of a set
• Planar separator theorem
• Graph coloring

Distributed Parallel Inference on Large Factor Graphs Joseph E. Gonzalez Carnegie Mellon University

Source URL: select.cs.cmu.edu

• Graphical models
• NP-complete problems
• Coding theory
• Belief propagation
• Probability theory
• Factor graph
• Graph partition
• Ear decomposition
• Distributed computing
• Matching
• Graph coloring
• RochaThatte cycle detection algorithm

Using Local Spectral Methods to Robustify Graph-Based Learning Algorithms David F. Gleich Computer Science Department Purdue University West Lafayette, IN

Source URL: www.stat.berkeley.edu

• Graph theory
• Mathematics
• NP-complete problems
• Graph partition
• Connectivity
• Graph coloring
• Graph
• Nonlinear dimensionality reduction
• Vertex
• SPQR tree
• Signed graph

COMPUTING THE PARTITION FUNCTION FOR GRAPH HOMOMORPHISMS WITH MULTIPLICITIES ´n Alexander Barvinok and Pablo Sobero July 2015

Source URL: www.math.lsa.umich.edu

• Graph theory
• Mathematics
• NP-complete problems
• Graph operations
• Graph coloring
• Line graph
• Matching
• Two-graph
• Train track map

Maximizing Submodular Set Function with Connectivity Constraint: Theory and Application to Networks Tung-Wei Kuo† ‡ , Kate Ching-Ju Lin† , and Ming-Jer Tsai‡ † Research Center for Information Technology Innova

Source URL: nms.citi.sinica.edu.tw

• Mathematics
• Graph theory
• Computational complexity theory
• Combinatorial optimization
• Submodular set function
• Edsger W. Dijkstra
• NP-complete problems
• Algorithm
• Shortest path problem
• HeldKarp algorithm
• Dominating set

DEADLINES & PLACEMENT OPTIONS THE DIAMONDBACK Deadlines

Source URL: s3.amazonaws.com

• NP-complete problems
• Recreational mathematics
• Leisure
• Marketing
• Sudoku
• Media manipulation
• Crossword
• Column inch
• Advertising
• The Diamondback

HAMILTON CYCLES IN GRAPHS AND HYPERGRAPHS: AN EXTREMAL PERSPECTIVE ¨ DANIELA KUHN AND DERYK OSTHUS Abstract. As one of the most fundamental and well-known NP-complete problems, the Hamilton

Source URL: web.mat.bham.ac.uk

A PARTICLE SWARM OPTIMIZATION HYPER-HEURISTIC FOR THE DYNAMIC VEHICLE ROUTING PROBLEM Michal Okulewicz, Jacek Ma´ ndziuk Faculty of Mathematics and Information Science, Warsaw University of Technology,

Source URL: bioma.ijs.si

• Operations research
• Mathematical optimization
• Mathematics
• Applied mathematics
• Computational complexity theory
• NP-complete problems
• Cybernetics
• Evolutionary algorithms
• Ant colony optimization algorithms
• Particle swarm optimization
• Swarm intelligence
• Hyper-heuristic

Microsoft PowerPoint - DIALMPOMC03.ppt

Source URL: disco.ethz.ch

• Graph theory
• NP-complete problems
• Wireless networking
• Unit disk graph
• Routing algorithms
• Wireless ad hoc network
• Routing
• Topology control
• Topological graph theory
• Planar graph
• Geographic routing
• Graph coloring

B. Balasundaram · S. Butenko · I. V. Hicks? · S. Sachdeva Clique Relaxations in Social Network Analysis: The Maximum k-plex Problem

Source URL: www.caam.rice.edu

• Graph theory
• NP-complete problems
• Clique
• Degeneracy
• Dominating set
• Independent set
• Graph
• Degree
• Graph coloring
• Extremal graph theory